On a Factorization of Graded Hopf Algebras Using Lyndon Words
نویسنده
چکیده
We find a generalization of the restricted PBW basis for pointed Hopf algebras over abelian groups constructed by Kharchenko. We obtain a factorization of the Hilbert series for a wide class of graded Hopf algebras. These factors are parametrized by Lyndon words, and they are the Hilbert series of certain graded Hopf algebras.
منابع مشابه
A Quantum Analog of the Poincare–birkhoff–witt Theorem
We reduce the basis construction problem for Hopf algebras generated by skew-primitive semi-invariants to a study of special elements, called “super-letters,” which are defined by Shirshov standard words. In this way we show that above Hopf algebras always have sets of PBW-generators (“hard” super-letters). It is shown also that these Hopf algebras having not more than finitely many “hard” supe...
متن کاملHopf Algebras in Combinatorics (version Containing Solutions)
Introduction 5 1. What is a Hopf algebra? 7 1.1. Algebras 7 1.2. Coalgebras 8 1.3. Morphisms, tensor products, and bialgebras 9 1.4. Antipodes and Hopf algebras 13 1.5. Commutativity, cocommutativity 20 1.6. Duals 22 2. Review of symmetric functions Λ as Hopf algebra 28 2.1. Definition of Λ 28 2.2. Other Bases 30 2.3. Comultiplications 34 2.4. The antipode, the involution ω, and algebra generat...
متن کاملHall basis of twisted Lie algebras
In this paper we define a minimal generating system for the free twisted Lie algebra. This gives a correct formulation and a proof to an old statement of Barratt. To this aim we use properties of the Lyndon words and of the Klyachko idempotent which generalize to twisted Hopf algebras some similar results well known in the classical case.
متن کاملGraded Hopf Algebras and Pairings
We study positively-graded Hopf algebras and obtain (dual) Gabriel-type results on graded Hopf algebras. Using it, we get certain (non-degenerate) graded Hopf pairings between quantum symmetric algebras.
متن کاملInverse Lyndon words and Inverse Lyndon factorizations of words
Motivated by applications to string processing, we introduce variants of the Lyndon factorization called inverse Lyndon factorizations. Their factors, named inverse Lyndon words, are in a class that strictly contains anti-Lyndon words, that is Lyndon words with respect to the inverse lexicographic order. We prove that any nonempty word w admits a canonical inverse Lyndon factorization, named IC...
متن کامل